Stable marriage with ties and bounded length preference lists
نویسندگان
چکیده
منابع مشابه
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign graduating medical students to their first hospital posts. In such a setting, weak stability is the most common solution concept, and it is known that ...
متن کاملStable Marriage with Incomplete Lists and Ties
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and several relaxations have been proposed, including the following two common ones: one is to allow an incomplete list, i.e., a man is permitted to accept only a subset of the women and vice versa. The other is to allow a pr...
متن کاملStable Marriage Problem with Ties and Incomplete bounded length preference list under social stability
We consider a variant of socially stable marriage problem where preference lists may be incomplete, may contain ties and may have bounded length. In real world application like NRMP and Scottish medical matching scheme such restrictions arise very frequently where set of agents (man/woman) is very large and providing a complete and strict order preference list is practically in-feasible. In pre...
متن کاملDistributed Stable Marriage with Ties and Incomplete Lists
The different versions of the Stable Marriage Problem can be efficiently solved by centralized algorithms. This requires to make public the preference lists of members, something that members would prefer to avoid for privacy reasons. This motivates a distributed formulation of this problem to keep privacy. We extend some algorithms from the centralized to the distributed case. However, they ar...
متن کاملStable Matchings with Ties, Master Preference Lists, and Matroid Constraints
In this paper, we consider a matroid generalization of the hospitals/residents problem with ties and master lists. In this model, the capacity constraints for hospitals are generalized to matroid constraints. By generalizing the algorithms of O’Malley for the hospitals/residents problem with ties and master lists, we give polynomial-time algorithms for deciding whether there exist a super-stabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2009
ISSN: 1570-8667
DOI: 10.1016/j.jda.2008.09.003